Probing High-Order Dependencies With Information Theory
نویسندگان
چکیده
منابع مشابه
Can high-order dependencies improve mutual information based feature selection?
Mutual information (MI) based approaches are a popular paradigm for feature selection. Most previous methods have made use of low-dimensional MI quantities that are only effective at detecting low-order dependencies between variables. Several works have considered the use of higher dimensional mutual information, but the theoretical underpinning of these approaches is not yet comprehensive. To ...
متن کاملInformation Dependencies Et Veritas Information Dependencies
This paper uses the tools of information theory to examine and reason about the information content of the attributes within a relation instance. For two sets of attributes, an information dependency measure (InD measure) characterizes the uncertainty remaining about the values for the second set when the values for the rst set are known. A variety of arithmetic inequalities (InD inequalities) ...
متن کاملModeling High-Order Dependencies in Local Appearance Models
We propose a novel local appearance modeling method for object detection and recognition in cluttered scenes. The approach is based on the joint distribution of local feature vectors at multiple salient points and their factorization with Independent Component Analysis (ICA). The resulting densities are simple multiplicative distributions modeled through adaptative Gaussian mixture models. This...
متن کاملChasing Polarized Order Dependencies
Dependencies have played a significant role in database design for many years. They have also been shown to be useful in query optimization. In this paper, we discuss the new type of dependency for polarized lexicographically ordered sets of tuples. We introduce formally the concept of polarized order dependencies (PODs). We discuss their potential significance for database systems, and present...
متن کاملFundamentals of Order Dependencies
Dependencies have played a significant role in database design for many years. They have also been shown to be useful in query optimization. In this paper, we discuss dependencies between lexicographically ordered sets of tuples. We introduce formally the concept of and present a set of axioms (inference rules) for them. We show how query rewrites based on these axioms can be used for query opt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2019
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2019.2920472